Rewriting Transfinite Terms
نویسندگان
چکیده
We define rewriting over terms with positions of transfinite length.
منابع مشابه
Transfinite Rewriting Semantics for Term Rewriting Systems
We provide some new results concerning the use of trans-nite rewriting for giving semantics to rewrite systems. We especially (but not only) consider the computation of possibly innnite constructor terms by transsnite rewriting due to their interest in many programming languages. We reconsider the problem of compressing transsnite rewrite sequences into shorter (possibly nite) ones. We also inv...
متن کاملThe defining core of a theory of infinitary term rewriting is its notion of convergence for transfinite reductions: which transfinite reductions
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and show that the metric model of convergence coincides with the partial order model restricted to total terms. Hence, partial order convergence constitutes a cons...
متن کاملOn confluence and residuals in Cauchy convergent transfinite rewriting
We show that non-collapsing orthogonal term rewriting systems do not have the transfinite Church-Rosser property in the setting of Cauchy convergence. In addition, we show that for (a transfinite version of) the Parallel Moves Lemma to hold, any definition of residual for Cauchy convergent rewriting must either part with a number of fundamental properties enjoyed by rewriting systems in the fin...
متن کاملSeparability of Infinite Lambda Terms
Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite reduction. In this paper we extend some classical results of finite lambda calculus to infinite terms. The first result we extend to infinite terms is Böhm Theorem which states the separability of two finite βη-normal forms. The second result we extend to infinite terms is the equivalence of the prefix rel...
متن کاملTransfinite rewriting
We survey the basic concepts and properties of transfinite rewriting for orthogonal term rewrite systems, lambda calculus, higher-order rewrite systems, and abstract rewrite systems.
متن کامل